EQUIVALENCE OF THE KRULL-MÜLLER-JAFFARD THEOREM AND RIBENBOIM'S APPROXIMATION THEOREM

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Krull Intersection Theorem

Let R be a commutative ring, / an ideal in R, and A an i?-module. We always have 0 £= 0 £ I(\~=1 I A £ f|ϊ=i JM. where S is the multiplicatively closed set {1 — i\ie 1} and 0 = 0s Π A = {α G A13S 6 S 3 sα = 0}. It is of interest to know when some containment can be replaced by equality. The Krull intersection theorem states that for R Noetherian and A finitely generated I Π*=i I A = Π~=i IA. Si...

متن کامل

The Remak-Krull-Schmidt Theorem on\ Fuzzy Groups

In this paper we study a representation of a fuzzy subgroup $mu$ of a group $G$, as a product of indecomposable fuzzy subgroups called the components of $mu$.  This representation is unique up to the number of components and their isomorphic copies. In the crisp group theory, this is a well-known Theorem attributed to Remak, Krull, and Schmidt. We consider the lattice of fuzzy subgroups and som...

متن کامل

the remak-krull-schmidt theorem on fuzzy groups

in this paper we study a representation of a fuzzy subgroup $mu$ of a group $g$, as a product of indecomposable fuzzy subgroups called the components of $mu$.  this representation is unique up to the number of components and their isomorphic copies. in the crisp group theory, this is a well-known theorem attributed to remak, krull, and schmidt. we consider the lattice of fuzzy subgroups and som...

متن کامل

The Multi-Procedure Equivalence Theorem

This paper concerns the question of whether program dependence graphs are “adequate” as a program representation. Previous results on the adequacy of program dependence graphs have been limited to a language without procedures and procedure calls. Our main result is a theorem that extends previous results to a language with procedures and procedure calls. The theorem shows that if the program d...

متن کامل

The Block Approximation Theorem

The block approximation theorem is an extensive generalization of both the well known weak approximation theorem from valuation theory and the density property of global fields in their henselizations. It guarantees the existence of rational points of smooth affine varieties that solve approximation problems of local-global type (see e.g. [HJP07]). The theorem holds for pseudo real closed field...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Memoirs of the Faculty of Science, Kyushu University. Series A, Mathematics

سال: 1963

ISSN: 1883-2172,0373-6385

DOI: 10.2206/kyushumfs.17.145